A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Kannan, E.
- Multiple Channels Utilization in Collision Free MAC Protocol for Wireless Ad Hoc Networks
Authors
1 Department of Computer Science and Engineering, Veltech Dr.RR & Dr.SR Technical University, Chennai, IN
Source
Wireless Communication, Vol 3, No 16 (2011), Pagination: 1155-1159Abstract
Wireless ad hoc network, though it is not structured by itself, represents a powerful communication infrastructure. The distributed and flexible architecture of wireless ad hoc networks is a key factor; however, their wide deployment relies on protocols capable of providing energy optimization, high channel utilization, support for real time traffic, etc. In such a context, recently a Collision Free MAC protocol has been proposed. Its effectiveness has been already investigated showing significant improvements compared to the Standard IEEE 802.11, in terms of throughput, one way packet delay, energy consumption and support of real time traffic. This paper suggests a means for utilization of multiple parallel wireless channels and proposes an enhanced version called ECF-MAC, by imposing all stations to stay awake and ready to receive during the access window. Therefore, a transmitting station will surely find awake its destination station.Keywords
Collision Free MAC, Power Saving, Wireless Networks, Variable Time Slot.
- Memory Management by Using Association Rules Mining and Mine Frequent Pattern in Large Data Base
Authors
1 School of Computer Science & Engineering, Vel Tech Dr.RR & Dr.SR Technical University, Avadi, Chennai-600 062, IN
Source
Data Mining and Knowledge Engineering, Vol 2, No 12 (2010), Pagination:Abstract
Association rules mining Rely on special data structures for the database in the primary memory. These data structure resides in the main memory, but these to handle the storage problem when they go out of the primary memory.VMM stores the overload data into the secondary memory based on some pre assumed memory handling method. So, it will arise the thrashing. This problem is solved by using ARM model capable of mining a transactional data base regardless of its size. The proposed data structure is constructed in the available allocated primary memory first. If it is grows out of the allocated memory quato them it forced to the secondary memory. The secondary memory version of the structure is accessed in a block-by-block basis so that both the spatial and temporal localities of the I/O access are optimized. the proposed framework takes control of the virtual memory access and hence manages the required virtual memory in an optimal way to the best benefit of the mining process to be served. Several clever data structures are used to facilitate these optimizations. Main purpose of this paper is to allocate memory and control this memory managing with the algorithm support.